Path hypergroupoids: Commutativity and graph connectivity
نویسندگان
چکیده
منابع مشابه
Graph Connectivity After Path Removal
Let G be a graph and u, v be two distinct vertices of G. A u−v path P is called nonseparating if G − V (P ) is connected. The purpose of this paper is to study the number of nonseparating u− v path for two arbitrary vertices u and v of a given graph. For a positive integer k, we will show that there is a minimum integer α(k) so that if G is an α(k)-connected graph and u and v are two arbitrary ...
متن کاملGraph cycles and diagram commutativity
Bases are exhibited for Kn, Kp,q, and Qd, and it is shown how each cycle of the various graphs can be built as a hierarchical ordered sum in which all of the partial sums are (simple) cycles with each cycle from either the basis or one of the hierarchically constructed cycle-sets meeting the partial sum of its predecessors in a nontrivial path. A property that holds for this “connected sum” of ...
متن کاملGradient-prolongation commutativity and graph theory
This note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very important, since it characterizes the gradients of coarse nodal functions in the coarse edge function space. They will be expressed using graph theory and they ...
متن کاملInduced Representations and Hypergroupoids
We review various notions of correspondences for locally compact groupoids with Haar systems, in particular a recent definition due to R.D. Holkar. We give the construction of the representations induced by such a correspondence. Finally, we extend the construction of induced representations to hypergroupoids.
متن کاملGraph Connectivity
This work is mainly concerned with the strength of connections between vertices with respect to the number of vertexor edge-disjoint paths. As we shall see, this is equivalent to the question of how many nodes or edges must be removed from a graph to destroy all paths between two (arbitrary or specified) vertices. We review algorithms which • check k-vertex (k-edge) connectivity, • compute the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2015
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.08.012